Search results for " Logic"
showing 10 items of 1720 documents
OSSERVAZIONI SULLA FORTUNA E I FRAINTENDIMENTI DEL TRACTATUS LOGICO-PHILOSOPHICUS A CENT’ANNI DALLA SUA PUBBLICAZIONE
2022
Starting with a suggestion, the similarity between Wittgenstein and Montaigne, this article reconstructs a quick history of the substantial misunderstanding that, despite his enormous success, characterized the "Tractatus logico-philosophicus" and the role of ethical issue in this book.
The transition state and cognate concepts
2019
Abstract This review aims firstly to clarify the meanings of key terms and concepts associated with the idea of the transition state, as developed by theoreticians and applied by experimentalist, and secondly to provide an update to the meaning and significance of the transition state in an era when computational simulation, in which complexity is being increasingly incorporated, is commonly employed as a means by which to bridge the realms of theory and experiment. The relationship between the transition state and the potential-energy surface for an elementary reaction is explored, with discussion of the following terms: saddle point, minimum-energy reaction path, reaction coordinate, acti…
Removing the saturation assumption in Bank-Weiser error estimator analysis in dimension three
2020
International audience; We provide a new argument proving the reliability of the Bank-Weiser estimator for Lagrange piecewise linear finite elements in both dimension two and three. The extension to dimension three constitutes the main novelty of our study. In addition, we present a numerical comparison of the Bank-Weiser and residual estimators for a three-dimensional test case.
Restricted compositions and permutations: from old to new Gray codes
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…
Switching by Domain-Wall Automotion in Asymmetric Ferromagnetic Rings
2017
A ring-shaped magnetic logic device offers two vortex states (clockwise and counterclockwise) to encode bits, with relative stability against external magnetic fields. The dynamics of magnetization switching in such structures, though, still need unraveling. The authors present direct experimental visualization of reproducible, robust switching in magnetic rings via domain-wall automotion, which does not require an applied field. Simulations reveal that annihilation of domain walls through automotion always occurs, with the detailed topology of the walls only influencing the dynamics locally, in line with the experimental results.
Towards Open Domain Chatbots—A GRU Architecture for Data Driven Conversations
2018
Understanding of textual content, such as topic and intent recognition, is a critical part of chatbots, allowing the chatbot to provide relevant responses. Although successful in several narrow domains, the potential diversity of content in broader and more open domains renders traditional pattern recognition techniques inaccurate. In this paper, we propose a novel deep learning architecture for content recognition that consists of multiple levels of gated recurrent units (GRUs). The architecture is designed to capture complex sentence structure at multiple levels of abstraction, seeking content recognition for very wide domains, through a distributed scalable representation of content. To …
Approximate treatment of higher excitations in coupled-cluster theory. II. Extension to general single-determinant reference functions and improved a…
2008
The theory and implementation of approximate coupled-cluster (CC), in particular approximate CC singles, doubles, triples, and quadruples methods, are discussed for general single-determinant reference functions. While the extension of iterative approximate models to the non-Hartree-Fock case is straightforward, the generalization of perturbative approaches is not trivial. In contrast to the corresponding perturbative triples methods, there are additional terms required for non-Hartree-Fock reference functions, and there are several possibilities to derive approximations to these terms. As it turns out impossible to develop an approach that is consistent with the canonical Hartree-Fock-base…
Smoothed Spherical Truncation based on Fuzzy Membership Functions: Application to the Molecular Encoding.
2019
A novel spherical truncation method, based on fuzzy membership functions, is introduced to truncate interatomic (or interaminoacid) relations according to smoothing values computed from fuzzy membership degrees. In this method, the molecules are circumscribed into a sphere, so that the geometric centers of the molecules are the centers of the spheres. The fuzzy membership degree of each atom (or aminoacid) is computed from its distance with respect to the geometric center of the molecule, by using a fuzzy membership function. So, the smoothing value to be applied in the truncation of a relation (or interaction) is computed by averaging the fuzzy membership degrees of the atoms (or aminoacid…
Fuzzy quantification of common and rare species in ecological communities (FuzzyQ)
2021
International audience; Most species in ecological communities are rare, whereas only a few are common. This distributional paradox has intrigued ecologists for decades but the interpretation of species abundance distributions remains elusive.We present Fuzzy Quantification of Common and Rare Species in Ecological Communities (FuzzyQ) as an R package. FuzzyQ shifts the focus from the prevailing species-categorization approach to develop a quantitative framework that seeks to place each species along a rarity-commonness gradient. Given a community surveyed over a number of sites, quadrats, or any other convenient sampling unit, FuzzyQ uses a fuzzy clustering algorithm that estimates a probab…
Thompson Sampling Based Active Learning in Probabilistic Programs with Application to Travel Time Estimation
2019
The pertinent problem of Traveling Time Estimation (TTE) is to estimate the travel time, given a start location and a destination, solely based on the coordinates of the points under consideration. This is typically solved by fitting a function based on a sequence of observations. However, it can be expensive or slow to obtain labeled data or measurements to calibrate the estimation function. Active Learning tries to alleviate this problem by actively selecting samples that minimize the total number of samples needed to do accurate inference. Probabilistic Programming Languages (PPL) give us the opportunities to apply powerful Bayesian inference to model problems that involve uncertainties.…